Primality tests - PDFSEARCH.IO - Document Search Engine

Primality tests
Results: 109

#	Item
51	IMPLEMENTING THE ASYMPTOTICALLY FAST VERSION OF THE ELLIPTIC CURVE PRIMALITY PROVING ALGORITHM F. MORAIN Abstract. The elliptic curve primality proving (ECPP) algorithm is one of the current fastest practical algorithms Add to Reading List Source URL: www.lix.polytechnique.fr Language: English - Date: 2005-12-13 09:43:17 Number theory Finite fields Conjectures Analytic number theory Elliptic curves Elliptic curve primality proving AKS primality test Quadratic residue Prime number Abstract algebra Mathematics Primality tests
52	Primecoin: Cryptocurrency with Prime Number Proof-of-Work Sunny King ([removed]) July 7th, 2013 Abstract A new type of proof-of-work based on searching for prime numbers is introduced Add to Reading List Source URL: primecoin.io Language: English - Date: 2014-04-12 02:09:34 Integer sequences Cryptography Prime numbers Bitcoin Peer-to-peer computing Primality tests Proof-of-work system Sophie Germain prime Primality certificate Mathematics Numbers Number theory
53	version[removed]Primality testing with Gaussian periods Primality testing with Gaussian periods H. W. Lenstra jr. and Carl Pomerance Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2009-10-01 13:32:09 Primality tests Finite fields Polynomials Integer factorization algorithms Field theory Prime number Root of unity Number theory Miller–Rabin primality test Abstract algebra Mathematics Algebra
54	UPDATE ON PRIMALITY TESTING SERGEI V. KONYAGIN AND CARL POMERANCE Abstract. We discuss recent developments in the ﬁeld of primality testing since the appearance [10] of our joint paper On primes recognizable in determi Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2013-03-26 10:46:38 Mathematics AKS primality test Prime number Miller–Rabin primality test Integer factorization Randomized algorithm Time complexity Quadratic residue Jacobi symbol Theoretical computer science Computational complexity theory Primality tests
55	J. Cryptology[removed]:[removed]Journal of Cryptology[removed]International Association for Cryptologic Research Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2010-11-16 14:00:41 Modular arithmetic Primality tests Euclidean algorithm Prime number Quadratic residue Randomized algorithm Factorization of polynomials over a finite field and irreducibility tests Miller–Rabin primality test Mathematics Number theory Abstract algebra
56	version[removed]Primality testing with Gaussian periods Primality testing with Gaussian periods H. W. Lenstra jr. and Carl Pomerance Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2009-02-25 13:32:39 Primality tests Finite fields Polynomials Integer factorization algorithms Field theory Prime number Root of unity Miller–Rabin primality test Elliptic curve primality testing Abstract algebra Mathematics Algebra
57	GENERATING RANDOM FACTORED GAUSSIAN INTEGERS, EASILY NOAH LEBOWITZ-LOCKARD AND CARL POMERANCE Abstract. We present a (random) polynomial-time algorithm to generate a random Gaussian integer with the uniform distribution Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2014-04-22 08:51:43 Integer factorization algorithms Modular arithmetic Primality tests Finite fields Miller–Rabin primality test Prime number Quadratic reciprocity Gaussian integer Coprime Mathematics Abstract algebra Number theory
58	version[removed]Primality testing with Gaussian periods Primality testing with Gaussian periods H. W. Lenstra jr. and Carl Pomerance Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2009-12-11 15:17:22 Finite fields Primality tests Polynomials Field theory Elliptic curves Prime number Frobenius endomorphism Root of unity Miller–Rabin primality test Abstract algebra Mathematics Algebra
59	PRIMALITY TESTING: VARIATIONS ON A THEME OF LUCAS CARL POMERANCE ´ Abstract. This survey traces an idea of Edouard Lucas that is a common element in various primality tests. These tests include those based on Fermat’s Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2009-02-17 14:07:37 Primality tests AKS primality test Quadratic residue Prime number Lucas primality test Generalized Riemann hypothesis Mersenne prime Pseudoprime Riemann hypothesis Mathematics Abstract algebra Number theory
60	Benjamin Fine Gerhard Rosenberger Number Theory An Introduction via the Distribution of Primes Add to Reading List Source URL: www.plouffe.fr Language: English - Date: 2014-05-28 20:50:31 Algebraic number theory Integer sequences Analytic number theory Prime number Primality tests Fundamental theorem of arithmetic Integer factorization Gaussian integer Ideal class group Mathematics Abstract algebra Number theory